Privacy Preservation Authentication: Group Secret Handshake with Multiple Groups
نویسندگان
چکیده
The technique of group secret handshake (GSH) has been used to help the members affiliated with same in achieving private authentication. After executing GSH protocols, participants can compute a shared key, or generate public encryption key while true self-compute their decryption keys. This paper presents concrete protocol Multiple Groups. Only legitimate member prove that it belongs set affiliations, but which affiliation will not be leaked. Group Authority reveal real identities fellows proposed scheme after analyzing flow communication. provide affiliation-hiding and detectability. In addition, achieves Perfect Forward Secrecy.
منابع مشابه
A digital memories based user authentication scheme with privacy preservation
The traditional username/password or PIN based authentication scheme, which still remains the most popular form of authentication, has been proved insecure, unmemorable and vulnerable to guessing, dictionary attack, key-logger, shoulder-surfing and social engineering. Based on this, a large number of new alternative methods have recently been proposed. However, most of them rely on users being ...
متن کاملA Provably Secure Secret Handshake with Dynamic Controlled Matching
A Secret Handshake is a protocol that allows two users to mutually verify one another’s properties, and in case of simultaneous matching, to share a key used to secure subsequent communications. In this paper, we present the first Secret Handshake scheme that allows dynamic matching of properties under stringent security requirements: in particular, the right to prove and to verify is strictly ...
متن کاملSecret Handshake: Strong Anonymity Definition and Construction
Secret handshake allows two members in the same group to authenticate each other secretly. In previous works of secret handshake schemes, two types of anonymities against the group authority (GA) of a group G are discussed: 1)Even GA cannot identify members, namely nobody can identify them (No-Traceability), 2)Only GA can identify members (Traceability). In this paper, first the necessity of tr...
متن کاملA Provably Secure Secret Handshake with Dynamic Controlled Matching
Parties cooperating in hostile networked environments often need to establish an initial trust. Trust establishment can be very delicate when it involves the exchange of sensitive information, such as affiliation to a secret society or to an intelligence agency. Two mechanisms, Secret Handshakes and Secure Matchmaking, have tackled this problem, coming up with solutions for secure initial excha...
متن کاملAn Innovation in Palm Vein Authentication for Biometric Privacy Preservation
In real-time security applications, the image processing, and computer vision play a major part in determining the whole operation. The main advantages of biometric privacy are, to keep the information safe and secure, and access the information from anywhere at any time. In some traditional cases, the security systems are processed by passwords, personal identification numbers, and identificat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2023
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math11030532